Retrieving library functions by unifying types modulo linear isomorphism

Retrieving Library Functions by Unifying Types Modulo Linear Isomorphism

An improved method to retrieve a library function via its Hindley/Milner type is described. Previous retrieval systems have identiied types that are isomorphic in any Cartesian closed category (CCC), and have retrieved library functions of types that are either isomorphic to the query, or have instances that are. Sometimes it is useful to instantiate the query too, which requires uniication mod...

Reachability Modulo Theory Library

Reachability analysis of infinite-state systems plays a central role in many verification tasks. In the last decade, SMT-Solvers have been exploited within many verification tools to discharge proof obligations arising from reachability analysis. Despite this, as of today there is no standard language to deal with transition systems specified in the SMT-LIB format. This paper is a first proposa...

Isomorphism Types of Index Sets of Partial Recursive Functions

1. Let [qo, qi,q2, ■ • ■ J be a Kleene enumeration of partial recursive functions. If / is such a function, denote by 9f its index set, 9f= {ra|g„^/}. Insofar as the indices of a partial recursive function correspond to the different sets of "instructions" for computing its values, it is natural to ask how much of the "complexity" of the function is reflected by its index set; for example, one ...

A Decision Algorithm for Linear Isomorphism of Types with Complexity

It is known that ordinary isomorphisms (associativity and commutativity of “times”, isomorphisms for “times” unit and currying) provide a complete axiomatisation for linear isomorphism of types. One of the reasons to consider linear isomorphism of types instead of ordinary isomorphism was that better complexity could be expected. Meanwhile, no upper bounds reasonably close to linear were obtain...

Isomorphism Types of Trees1